Implementing conditional term rewriting by graph rewriting
نویسندگان
چکیده
منابع مشابه
Conditional Term Graph Rewriting
For eeciency reasons, term rewriting is usually implemented by graph rewriting. It is known that graph rewriting is a sound and complete implementation of (almost) orthogonal term rewriting systems; see BEG + 87]. In this paper, we extend the result to properly oriented orthogonal conditional systems with strict equality. In these systems extra variables are allowed in conditions and right-hand...
متن کاملTerm Graph Rewriting 5 4 Adequacy of Graph Rewriting for Term Rewriting 8 5 Implementing Term Rewriting
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In earlier work, the authors have shown that for confluent TRSs, innermost polynomial runtime complexity induces polytime computability of the functions defined. In this paper, we generalise the above result to full rewriting. Following our...
متن کاملTerm Graph Rewriting and Parallel Term Rewriting
The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one term graph reduction may correspond to infinitely many term reductions. We stress that this fact can be interpreted in two ways. According to the ...
متن کاملImplementing Term Rewriting by Graph Reduction: Termination of Combined Systems
It is well known that the disjoint union of terminating term rewriting systems does not yield a terminating system in general. We show that this undesirable phenomenon vanishes if one implements term rewriting by graph reduction: given two terminating term rewrite systems 7~o and 7~1, the graph reduction system implementing 7~0 -F T~1 is terminating. In fact, we prove the stronger result that t...
متن کاملTransitive Term Graph Rewriting
A version of generalised term graph rewriting is presented in which redirections are interpreted transitively. It is shown that the new semantics enjoy enhanced properties regarding ease of implementation on distributed machines compared with conventional semantics because of the Church-Rosser properties of transitive redirections. Furthermore, the good properties of orthogonal systems are larg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00209-7